DG2CEP: A Density-Grid Stream Clustering Algorithm based on Complex Event Processing for Cluster Detection

نویسندگان

  • Marcos Roriz
  • Markus Endler
چکیده

Applications such as fleet and mobile task force management, or traffic control can largely benefit from the on-line detection of collective mobility patterns of vehicles, goods or persons. A common mobility pattern is a cluster, a concentration of mobile nodes in a certain region, e.g., a mass protest, a rock concert, or a traffic jam. Current approaches require previous knowledge of the locations where the cluster might happen. In this paper, we propose DG2CEP, an algorithm inspired by data mining algorithms and based on Complex Event Processing, for on-line detection of such clusters. It can detect the formation and dispersion of clusters from streams of position data without the need of specifying the possible locations of clusters in advance.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Grid-based Data Stream Clustering for Intrusion Detection

As a kind of stream data mining method, stream clustering has great potentiality in areas such as network traffic analysis, intrusion detection, etc. This paper proposes a novel grid-based clustering algorithm for stream data, which has both advantages of grid mapping and DBSCAN algorithm. The algorithm adopts the two-phase model and in the online phase, it maps stream data into a grid and the ...

متن کامل

DENGRIS-Stream: A Density-Grid based Clustering Algorithm for Evolving Data Streams over Sliding Window

Evolving data streams are ubiquitous. Various clustering algorithms have been developed to extract useful knowledge from evolving data streams in real time. Density-based clustering method has the ability to handle outliers and discover arbitrary shape clusters whereas grid-based clustering has high speed processing time. Sliding window is a widely used model for data stream mining due to its e...

متن کامل

A Novel High Dimensional and High Speed Data Streams Algorithm: HSDStream

This paper presents a novel high speed clustering scheme for high-dimensional data stream. Data stream clustering has gained importance in different applications, for example, network monitoring, intrusion detection, and real-time sensing. High dimensional stream data is inherently more complex when used for clustering because the evolving nature of the stream data and high dimensionality make ...

متن کامل

Research on Clustering Algorithm Based on Grid Density on Uncertain Data Stream

To solve the clustering algorithm based on grid density on uncertain data stream in adjustment cycle for clustering omissions, the paper proposed an algorithm, named GCUDS, to cluster uncertain data steam using grid structure. The concept of the data trend degree was defined to describe the grade of a data point belonging to some grid unit and the defect of information loss around grid units wa...

متن کامل

Approximate Clustering on Data Streams Using Discrete Cosine Transform

In this study, a clustering algorithm that uses DCT transformed data is presented. The algorithm is a grid density-based clustering algorithm that can identify clusters of arbitrary shape. Streaming data are transformed and reconstructed as needed for clustering. Experimental results show that DCT is able to approximate a data distribution efficiently using only a small number of coefficients a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014